Internal combustion engine test plan execution order optimization using Travelling Salesman Problem heuristics approach
نویسندگان
چکیده
Abstract For a given internal combustion (IC) engine stationary test plan, significant time savings during its realization could be achieved if the sequence of points execution is adequately determined. The criterion for stabilizing operating point determined by magnitude change in most inert parameter, and general case, it temperature exhaust gases. A certain level prior knowledge about examined object necessary to conduct such an analysis. If there are no results from previous tests, simulation models, or experiences, Slow Dynamic Slope (SDS) tests great way quickly gather information. task finding optimal testing plan can set as Travelling Salesman Problem (TSP). This paper will present application one heuristic methods solving TSP on example IC engine, which very complex dynamic system. Following this model, possible optimize any other basic idea find points, minor deviation gas obtained, resulting point's shortest stabilization time.
منابع مشابه
Implementation of Travelling Salesman Problem Using ant Colony Optimization
Within the Artificial Intelligence community, there is great need for fast and accurate traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Cost can be distance, time, money, energy, etc. Travelling salesman problem (TSP) is a combinatorial optimization problem. TSP is the most intensively studied problem in the area of optimization. Ant colony opti...
متن کاملParallel Implementation of Travelling Salesman Problem using Ant Colony Optimization
In this paper we have proposed parallel implementation of Ant colony optimization Ant System algorithm on GPU using OpenCL. We have done comparison on different parameters of the ACO which directly or indirectly affect the result. Parallel comparison of speedup between CPU and GPU implementation is done with a speed up of 3.11x in CPU and 7.21x in GPU. The control parameters α, β, ρ is done wit...
متن کاملComparison of heuristics for the colourful travelling salesman problem
In the colourful travelling salesman problem (CTSP), given a graph G with a (not necessarily distinct) label (colour) assigned to each edge, a Hamiltonian tour with the minimum number of different labels is sought. The problem is a variant of the well-known Hamiltonian cycle problem and has potential applications in telecommunication networks, optical networks, and multimodal transportation net...
متن کاملHeuristics for sparse general travelling salesman problems
The well-known travelling salesman problem can be expressed in graphtheoretic terms as follows : find a minimum-weight Hamiltonian cycle in a connected edge-weighted graph G(N, A). vVe concentrate here on the problem where G is large and sparse, i.e., where INI is 500 or more and IAI is O( INI). Such graphs arise frequently in practice, where G represents a road network, and each node (city) is...
متن کاملNew Variations of Order Crossover for Travelling Salesman Problem
Davis presented the order crossover operator for solving the travelling salesman problem (TSP) using genetic algorithm and has described two basic variants of this order crossover operator. In order to improve the efficiency and validity of these variants, in this paper three new variations of the order crossover operator are presented. These are programmed in C++ and implemented on a set of be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2022
ISSN: ['1757-8981', '1757-899X']
DOI: https://doi.org/10.1088/1757-899x/1271/1/012005